منابع مشابه
Finding Hamiltonian circuits in quasi-adjoint graphs
This paper is motivated by a method used for DNA sequencing by hybridization presented in [Jacek Blazewicz, Marta Kasprzak, Computational complexity of isothermic DNA sequencing by hybridization, Discrete Appl. Math. 154 (5) (2006) 718–729]. This paper presents a class of digraphs: the quasi-adjoint graphs. This class includes the ones used in the paper cited above. A polynomial recognition alg...
متن کاملAlternating Hamiltonian circuits in edge-coloured bipartite graphs
Hilton, A. J. W., Alternating Hamiltonian circuits in edge-coloured bipartite graphs, Discrete Applied Mathematics 35 (1992) 271-273. We show that if G = K,, is edge-coloured with t-12 colours so that the subgraph induced by the edges of each colour is regular of order 2n, then G has a Hamiltonian circuit in which adjacent edges have different colours. We also give a generalization of this resu...
متن کاملHamiltonian Factors in Hamiltonian Graphs
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamiltonian cycle. In this paper, two sufficient conditions are given, which are two neighborhood conditions for a Hamiltonian graph G to have a Hamiltonian factor. Keywords—graph, neighborhood, factor, Hamiltonian factor.
متن کاملMemristor Hamiltonian Circuits
We prove analytically that 2-element memristiue c'ircuits consisting of a pass'iue I'inearinductor in parallel with a pass,iue memristor, or an act'iue memristiue deuice, can be described explicitly by a Hami,ltonian eqttation, whose solutions can be periodic or damped, and can be represented analytically by the constants of the motion along the circuit Hamiltonian. Generalizations to 3-element...
متن کاملA note on Hamiltonian circuits
Proof. Let G satisfy the hypothesis of Theorem 1. Clearly, G contains a circuit ; let C be the longest one . If G has no Hamiltonian circuit, there is a vertex x with x ~ C . Since G is s-connected, there are s paths starting at x and terminating in C which are pairwise disjoint apart from x and share with C just their terminal vertices x l, X2, . . ., x s (see [ 11, Theorem 1) . For each i = 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1965
ISSN: 0528-2195
DOI: 10.21136/cpm.1965.117525